8.1 Makespan Scheduling
نویسندگان
چکیده
Definition 8.1.1 Let P = ∑ i∈J Pi. Clearly 1 ≤ OPT ≤ P . Since 1 ≤ OPT ≤ P , if we have access to a (1 + )-relaxed decision procedure we can use it O(logP ) times to do a binary search on different values of T (between 1 and P ) to find a (1 + )approximation. Since logP is polynomial in the input size, if the relaxed decision procedure runs in polynomial time then we have a (1 + )-approximation for Makespan Scheduling that runs in polynomial time.
منابع مشابه
A Hybrid Genetic Algorithm for the Open Shop Scheduling with Makespan and Total Completion Time
Proper scheduling of tasks leads to optimum using of time and resources, in order to obtaining best result. One of the most important and complicated scheduling problems is open shop scheduling problem. There are n jobs in open shop scheduling problem which should be processed by m machines. Purpose of scheduling open shop problem is attaining to a suitable order of processing jobs by specified...
متن کاملA Hybrid Genetic Algorithm for the Open Shop Scheduling with Makespan and Total Completion Time
Proper scheduling of tasks leads to optimum using of time and resources, in order to obtaining best result. One of the most important and complicated scheduling problems is open shop scheduling problem. There are n jobs in open shop scheduling problem which should be processed by m machines. Purpose of scheduling open shop problem is attaining to a suitable order of processing jobs by specified...
متن کاملMinimizing the total tardiness and makespan in an open shop scheduling problem with sequence-dependent setup times
We consider an open shop scheduling problem with setup and processing times separately such that not only the setup times are dependent on the machines, but also they are dependent on the sequence of jobs that should be processed on a machine. A novel bi-objective mathematical programming is designed in order to minimize the total tardiness and the makespan. Among several mult...
متن کاملA Mathematical Model for a Flow Shop Scheduling Problem with Fuzzy Processing Times
This paper presents a mathematical model for a flow shop scheduling problem consisting of m machine and n jobs with fuzzy processing times that can be estimated as independent stochastic or fuzzy numbers. In the traditional flow shop scheduling problem, the typical objective is to minimize the makespan). However,, two significant criteria for each schedule in stochastic models are: expectable m...
متن کاملMinimizing the maximum tardiness and makespan criteria in a job shop scheduling problem with sequence dependent setup times
The job shop scheduling problem (JSP) is one of the most difficult problems in traditional scheduling because any job consists of a set operations and also any operation processes by a machine. Whereas the operation is placed in the machine, it is essential to be considering setup times that the times strongly depend on the various sequencing of jobs on the machines. This research is developed ...
متن کامل